Minimizing Makespan in Flowshops with Bounded Processing Times

CT : The two-machine flowshop scheduling problem of minimizing makespan is addressed where jobs have rocessing times which are bounded within certain intervals. The probability distributions of job processing hin intervals are not known. The only known information about job processing times is the lower and upper he decision about a solution of the problem, i.e., finding a sequence, has to be made based on these bounds. heuristics using the bounds are proposed, and the proposed heuristics are compared based on randomly data. The computational analysis has shown that three of the proposed heuristics perform well with an overall rror of less than one percent. Moreover, it has also shown that one of the heuristics, which applies Johnson's to the average of the lower and upper bounds, perform as the best with an overall average percentage error of obtained results are also shown to be consistent with the recent results obtained in the literature.